Linear graph grammars: Power and complexity

Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity

A Note on the Equivalence and Complexity of Linear Grammars

Linear languages can be characterized by regular-like expressions (linear expressions) according to a previous work. In this paper, we consider some equivalence properties of linear expressions in order to obtain a characterization of reversal and Kolmogorov complexity of linear languages. First, we introduce the relationship between regular expressions equivalence properties and linear express...

Refining the Nonterminal Complexity of Graph-controlled Grammars

We refine the classical notion of the nonterminal complexity of graph-controlled grammars, programmed grammars, and matrix grammars by also counting, in addition, the number of nonterminal symbols that are actually used in the appearance checking mode. We prove that every recursively enumerable language can be generated by a graph-controlled grammar with only two nonterminal symbols when both s...

Similarities Between String Grammars and Graph Grammars

In this paper, we present some studies about relations existing between well known Chomsky string grammars and graph grammars, in particularly hypergraph grammars. We are discussing about deterministic context free Lindenmayer Systems used to describe commands to a device that generates black and white digital images. Instead of well-known methods of drawing, we will paint squares, not lines. A...

Near-Linear Query Complexity for Graph Inference

Given a mental picture Ĝ = (V, Ê) of some unknown graph G = (V,E), how can we verify that our mental image is correct, when the unknown graph is only accessible by querying pairs of vertices and getting their shortest path distance in G? For graphs of bounded degree, we give an algorithm that uses a number of queries that is at most O(log n) times the minimum number achievable. For graphs that ...